Computing Connection Distance Index of Derived Graphs
نویسندگان
چکیده
Distance based topological indices (TIs) play a vital role in the study of various structural and chemical aspects for molecular graphs. The first distance-based TI is used to find boiling point paraffin. connection distance (CD) index latest developed that defined as sum all products distances between pair vertices with their respective numbers . In this paper, we computed CD different derived graphs (subdivision graph S G , vertex-semitotal id="M2"> R edge-semitotal id="M3"> Q total id="M4"> T obtained from id="M5"> under operations subdivision form degree (DD) basic including some other algebraic expressions.
منابع مشابه
Computing Szeged index of graphs on triples
ABSTRACT Let G=(V,E) be a simple connected graph with vertex set V and edge set E. The Szeged index of G is defined by where respectively is the number of vertices of G closer to u (respectively v) than v (respectively u). If S is a set of size let V be the set of all subsets of S of size 3. Then we define t...
متن کاملcomputing szeged index of graphs on triples
abstract let g=(v,e) be a simple connected graph with vertex set v and edge set e. the szeged index of g is defined by where respectively is the number of vertices of g closer to u (respectively v) than v (respectively u). if s is a set of size let v be the set of all subsets of s of size 3. then we define three ...
متن کاملComputing connection strength in probabilistic graphs
3 Probabilistic model for computing connection strength 5 3.1 Preliminaries . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 6 3.2 Independent edge existence . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 8 3.2.1 General formulae . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 8 3.2.2 Computing path conn...
متن کاملdegree distance and gutman index of corona product of graphs
in this paper, the degree distance and the gutman index of the corona product of two graphs are determined. using the results obtained, the exact degree distance and gutman index of certain classes of graphs are computed.
متن کاملBounds of distance Estrada index of graphs
Let λ1, λ2, · · · , λn be the eigenvalues of the distance matrix of a connected graph G. The distance Estrada index of G is defined as DEE(G) = ∑ n i=1 ei . In this note, we present new lower and upper bounds for DEE(G). In addition, a Nordhaus-Gaddum type inequality for DEE(G) is given. MSC 2010: 05C12, 15A42.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematical Problems in Engineering
سال: 2022
ISSN: ['1026-7077', '1563-5147', '1024-123X']
DOI: https://doi.org/10.1155/2022/1439177